An experimental multiprocessor system for distributed parallel computations
نویسندگان
چکیده
منابع مشابه
An Experimental Multiprocessor System for Distributed Parallel Computations
Leo De Maeye r (1927) obtained the Dr. Sc. degree in physical chemistry in 1954 at the University of Leuven, Belgium. Since 1965 he is scientific member of the MaxPlanck-Gesellschaft and director of the Department of Experimental Methods at the Max-Planck-lnstitute of Biophysical Chemistry in Goettingen. He is also teaching at the University of Leuven where he founded the Laboratory of Chemical...
متن کاملAn Orthogonal Multiprocessor for Parallel Scientific Computations
A new multiprocessor architecture, called orthogonal multiprocessor (OMP), is proposed in this paper. This OMP architecture has a simplified busing structure and partially shared memory, which compares very favorably over fully shared-memory multiprocessors using crossbar switch, multiple buses, or multistage networks. The higher performance comes mainly from significantly increased memory band...
متن کاملDistributed BEAGLE: An Environment for Parallel and Distributed Evolutionary Computations
Evolutionary computation is a promising artificial intelligence field involving the simulation of natural evolution to solve problems. Given its implicit parallelism and high computational requirements, evolutionary computation is the perfect candidate for high performance parallel computers. This paper presents Distributed BEAGLE, a new master-slave architecture for parallel and distributed ev...
متن کاملScalable data abstractions for distributed parallel computations
The ability to express a program as a hierarchical composition of parts is an essential tool in managing the complexity of software and a key abstraction this provides is to separate the representation of data from the computation. Many current parallel programming models use a shared memory model to provide data abstraction but this doesn’t scale well with large numbers of cores due to non-det...
متن کاملScheduling Fork-join Computations on Distributed-memory Multiprocessor Systems
In this paper, we develop two analytic models for scheduling fork-join computations on distributed-memory multiprocessor system. The rst model allows for arriving tasks to multiplex processors with existing tasks, while the other model does not allow multiplexing. Both models assume that tasks block for I/O and that the overhead of rescheduling a task to another processor is prohibitive. We com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Microprocessing and Microprogramming
سال: 1990
ISSN: 0165-6074
DOI: 10.1016/0165-6074(90)90330-c